Failure Deterministic Finite Automata
نویسندگان
چکیده
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the DFA. A small modification to the classical DFA’s algorithm for recognising language elements yields a corresponding algorithm for an FDFA.
منابع مشابه
Reduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کاملOn Generating a Random Deterministic Finite Automaton as well as its Failure Equivalent
An algorithm is proposed that constructs a failure deterministic finite automaton in lockstep with the construction of a languageequivalent deterministic finite automaton. The states of both automata are assumed to be predefined and the failure deterministic finite automaton’s symbol and failure transitions are randomised. It is guaranteed that the latter remains free of divergent failure cycle...
متن کاملGAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING
In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...
متن کاملA Novel Method To Construct Deterministic Finite Automata From AGiven Regular Grammar
IJSER © 2015 http://www.ijser.org A Novel Method To Construct Deterministic Finite Automata From AGiven Regular Grammar K.Senthil Kumar D.Malathi Abstract—Membership checking is an important task in language formalism. In regular Language ,Deterministic Finite Automata plays membership checking in a convenient way. Regular language is normally represented by regular expression from which peopl...
متن کاملThe Learnability of Simple Deterministic Finite-Memory Automata
The present paper establishes the learnability of simple deterministic finitememory automata via membership and equivalence queries. Simple deterministic finite-memory automata are a subclass of deterministic finite-memory automata introduced by Kaminski and Francez [9] as a model generalizing finite-state automata to infinite alphabets. For arriving at a meaningful learning model we first prov...
متن کامل